Preconditioning with Direct Approximate Factoring of the Inverse
نویسندگان
چکیده
منابع مشابه
Preconditioning with Direct Approximate Factoring of the Inverse
To precondition a large and sparse linear system, two direct methods for approximate factoring of the inverse are devised. The algorithms are fully parallelizable and appear to be more robust than the iterative methods suggested for the task. A method to compute one of the matrix subspaces optimally is derived. Possessing a considerable amount of flexibility, these approaches extend the approxi...
متن کاملApproximate Inverse Preconditioning for Shifted Linear Systems
In this paper we consider the problem of preconditioning symmetric positive definite matrices of the form Aα = A+αI where α > 0. We discuss how to cheaply modify an existing sparse approximate inverse preconditioner for A in order to obtain a preconditioner for Aα. Numerical experiments illustrating the performance of the proposed approaches are presented. AMS subject classification (2000): 65F...
متن کاملApproximate inverse preconditioning in the parallel solution of sparse eigenproblems
A preconditioned scheme for solving sparse symmetric eigenproblems is proposed. The solution strategy relies upon the DACG algorithm, which is a Preconditioned Conjugate Gradient algorithm for minimizing the Rayleigh Quotient. A comparison with the well established ARPACK code, shows that when a small number of the leftmost eigenpairs is to be computed, DACG is more efficient than ARPACK. Effec...
متن کاملRobust Approximate Inverse Preconditioning for the Conjugate Gradient Method
We present a variant of the AINV factorized sparse approximate inverse algorithm which is applicable to any symmetric positive definite matrix. The new preconditioner is breakdownfree and, when used in conjunction with the conjugate gradient method, results in a reliable solver for highly ill-conditioned linear systems. We also investigate an alternative approach to a stable approximate inverse...
متن کاملApproximate Inverse Preconditioning of Iterative Methods for Nonsymmetric Linear Systems
A method for computing an incomplete factorization of the inverse of a nonsymmetric matrix A is presented. The resulting factorized sparse approximate inverse is used as a preconditioner in the iterative solution of Ax = b by Krylov subspace methods. 1. Introduction. We describe a method for computing an incomplete factorization of the inverse of a general sparse matrix A 2 IR nn. The resulting...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2014
ISSN: 1064-8275,1095-7197
DOI: 10.1137/12088570x